Self-adjusting Mapping: A Heuristic Mapping Algorithm for Mapping Parallel Programs on to Transputer Networks

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristic algorithm based on a genetic algorithm for mapping parallel programs on hypercube multiprocessors

The advent of cost-effective VLSI components in the past few years has made feasible the commercial development of massively parallel computers with hundreds of processors. Because of appealing properties such as node and edge symmetry, logarithmic diameter, high fault resilience, scalability, and the ability to host popular interconnection networks, namely ring, torus, tree and linear array, h...

متن کامل

A New Method for Color Gamut Mapping by Genetic Algorithm

To reproduce an image, it is necessary to map out of gamut colors of the image to destination gamut. It is clear that the best color gamut mapping introduces the perceptually closest image to the original one. In this study, a new color gamut mapping is purposed by the aid of Genetic Algorithm (GA). The color difference between the original and mapped images based on S-LAB formula was chosen as...

متن کامل

A Static Mapping Heuristic for Mapping Parallel Applications to Heterogeneous Computing Systems

To minimize the execution time of a parallel application running on a heterogeneous computing distributed system, an appropriate mapping scheme to allocate the application tasks to the processors is needed. The general problem of mapping tasks to machines is a well known NP-hard problem and several heuristics have been proposed to approximate its optimal solution. In this paper we propose a sta...

متن کامل

Heuristic Algorithm for Virtual Network Mapping Problem

Nowadays, resource allocation for virtual networks (VNs) is brought as an imperative problem. For the characteristics of virtual networks, multiple virtual networks with different topo can co-exist on a shared infrastructure. A difficult point of problem is how to use the resource effectively and to satisfy the requirement of virtual network request. This problem is NP-hard. In this paper, we i...

متن کامل

A Parallel Genetic Algorithm for Task Mapping on Parallel Machines

In parallel processing systems, a fundamental consideration is the maximization of system performance through task mapping. A good allocation strategy may improve resource utilization and increase signi cantly the throughput of the system. We demonstrate how to map the tasks among the processors to meet performance criteria, such as minimizing execution time or communication delays. We review t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1992

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/35.1.71